A generalized multivariable Newton method

نویسندگان

چکیده

Abstract It is well known that the Newton method may not converge when initial guess does belong to a specific quadratic convergence region. We propose family of new variants with potential advantage having larger region as more desirable properties near solution. prove family, and provide bounds for asymptotic error constant. illustrate advantages methods by means test problems, including two six variable polynomial systems, challenging signal processing example. present numerical experimental methodology which uses large number randomized guesses from in turn providing advice employed preferable use particular search domain.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Generalized Univariate Newton Method Motivated by Proximal Regularization

We devise a new generalized univariate Newton method for solving nonlinear equations, motivated by Bregman distances and proximal regularization of optimization problems. We prove quadratic convergence of the new method, a special instance of which is the classical Newton’s method. We illustrate the possible benefits of the new method over classical Newton’s method by means of test problems inv...

متن کامل

An improved generalized Newton method for absolute value equations

In this paper, we suggest and analyze an improved generalized Newton method for solving the NP-hard absolute value equations [Formula: see text] when the singular values of A exceed 1. We show that the global and local quadratic convergence of the proposed method. Numerical experiments show the efficiency of the method and the high accuracy of calculation.

متن کامل

Generalized Newton Method for Energy Formulations in Image Processing

Many problems in image processing are addressed via the minimization of a cost functional. The most prominent optimization technique is the gradient descent, often used due to its simplicity and applicability where other techniques, e.g., those coming from discrete optimization, can not be used. Yet, gradient descent suffers from a slow convergence, and often to just local minima which highly d...

متن کامل

On generalized Newton method for solving operator inclusions

In this paper, we study the existence and uniqueness theorem for solving the generalized operator equation of the form F(x) + G(x) + T(x) ∋ 0, where F is a Fréchet differentiable operator, G is a maximal monotone operator and T is a Lipschitzian operator defined on an open convex subset of a Hilbert space. Our results are improvements upon corresponding results of Uko [Generalized equations and...

متن کامل

New and Generalized Convergence Conditions for the Newton-kantorovich Method

We present new semilocal convergence theorems for Newton methods in a Banach space. Using earlier general conditions we find more precise error estimates on the distances involved using the majorant principle. Moreover we provide a better information on the location of the solution. In the special case of Newton’s method under Lipschitz conditions we show that the famous Newton–Kantorovich hypo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fixed Point Theory and Algorithms for Sciences and Engineering

سال: 2021

ISSN: ['2730-5422']

DOI: https://doi.org/10.1186/s13663-021-00700-9